Robust Hash Functions for Visual Data: An Experimental Comparison
نویسندگان
چکیده
Robust hash functions for visual data need a feature extraction mechanism to rely on. We experimentally compare spatial and transform domain feature extraction techniques and identify the global DCT combined with the cryptographic hash function MD-5 to be suited for visual hashing. This scheme offers robustness against JPEG2000 and JPEG compression and qualitative sensitivity to intentional global and local image alterations.
منابع مشابه
Compressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملRobust Visual Hashing Using JPEG 2000 225 2 . 1 Using the JPEG 2000 bitstream for feature extraction
Robust visual hash functions have been designed to ensure the data integrity of digital visual data. Such algorithms rely on an efficient scheme for robust visual feature extraction. We propose to use the wavelet-based JPEG2000 image compression algorithm for feature extraction. We discuss the sensitivity of our proposed method against different malicious data modifications including local imag...
متن کاملRobust Hash Functions for Digital Watermarking
Digital watermarks have recently been proposed for authentication of both video data and still images and for integrity verification of visual multimedia. In such applications, the watermark has to depend on a secret key and on the original image. It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust). Both requirements can be satis...
متن کاملLong-Period Hash Functions for Procedural Texturing
Procedural texturing is commonly used to increase visual complexity and realism in rendered scenes. Procedural texture basis functions, such as Perlin’s noise function, are often built on hash functions defined over the integer lattice. These hash functions are usually based on permutation tables and have a short period. This causes procedural textures to repeat. In this paper, we present a met...
متن کاملRobust hashing for multi-view data: Jointly learning low-rank kernelized similarity consensus and hash functions
Learning hash functions/codes for similarity search over multi-view data is attracting increasing attention, where similar hash codes are assigned to the data objects characterizing consistently neighborhood relationship across views. Traditional methods in this category inherently suffer three limitations: 1) they commonly adopt a two-stage scheme where similarity matrix is first constructed, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003